effectively enumerable

Definition

Given a set $D$ and a subset $S \subseteq D$, $S$ is effectively enumerable iff there is an effective procedure which, when given an object $x \in D$ will eventually answer "yes" if $x \in S$, and will eventually answer "no" or never terminate if $x \notin S$.

Notes

• compare effectively decidable

References

1. N. D. Jones, Computability and complexity: from a programming perspective. in Foundations of computing. Cambridge, Mass: MIT Press, 1997, p. 13.